Math . Nachr . ( 1996 ) , Decoding of codes on
نویسنده
چکیده
The Picard curves are genus three curves with a non trivial automorphism, which have been intensively studied due their connection with interesting number theoretic problems. In 1989, R. Pellikaan obtained an algorithm decoding geometric codes up to b(d ? 1)=2c-errors, where d is the designed distance of the code. His algorithm is not completely eeective, but recently some authors have given an eeective answer to Pellikaan's algorithm using the particular features of special curves, such as the Klein quartic and the hyperelliptic curves. In this paper we show that the Picard curves are suitable to obtain an eeective answer to Pel-likaan's algorithm .
منابع مشابه
Decoding of differential AG codes
The interpolation-based decoding that was developed for general evaluation AG codes is shown to be equally applicable to general differential AG codes. A performance analysis of the decoding algorithm, which is parallel to that of its companion algorithm, is reported. In particular, the decoding capacities of evaluation AG codes and differential AG codes are seen to be nicely interrelated. As a...
متن کاملList decoding of matrix-product codes from nested codes: An application to quasi-cyclic codes
A list decoding algorithm for matrix-product codes is provided when C1, . . . , Cs are nested linear codes and A is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Further...
متن کاملDecoding of 2D convolutional codes over an erasure channel
In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main idea is to reduce the decoding problem of 2D convolutional codes to a problem of decoding a set of associate...
متن کاملAn algebraic approach for decoding spread codes
We present a family of constant–dimension codes for random linear network coding called spread codes. This is a family of optimal codes with maximum minimum distance. A spread code is constructed starting from the algebra defined by the companion matrix of an irreducible polynomial. We give a minimum distance decoding algorithm that is particularly efficient when the dimension of the codewords ...
متن کاملAlgebraic decoding for doubly cyclic convolutional codes
An iterative decoding algorithm for convolutional codes is presented. It successively processes N consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be corrected. The algorithm can be efficiently used on a particular class of convolutional codes, known as doubly cyclic convolutional codes. Due to their highly a...
متن کامل